Survivable Consensus Objects
نویسندگان
چکیده
Reaching consensus among multiple processes in a distributed system is fundamental to coordinating distributed actions. In this paper we present a new approach to building survivable consensus objects in a system consisting of a (possibly large) collection of persistent object servers and a transient population of clients. Our consensus object implementation requires minimal support from servers, but at the same time enables clients to reach coordinated decisions despite the arbitrary (Byzantine) failure of any number of clients and up to a threshold number of servers.
منابع مشابه
Basic Mathematical Programming Models for Capacity Allocation in Mesh-based Survivable Networks
Designing a low cost, survivable, telecommunications network is an extremely complicated process. Most commercial products available to help with this process are based on simulation and/or proprietary heuristics. However, there is a growing consensus that mathematical programming belongs in the designer’s “toolkit.” Easyto-use modeling languages coupled with powerful optimization solvers have ...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملArchitecture and Execution Model for a Survivable Work﬇ow Transaction Infrastructure
We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, ensuring that applications continue to function correctly despite arbitrary (Byzantine) failure of a bounded num...
متن کاملA heuristic algorithm for survivable mapping in IP-over-WDM networks
Survivability is an important issue in IP-over-WDM networks. IP layer failure recovery is possible only if the IP topology is mapped onto the WDM topology in a survivable way, i.e., the failure of any single fiber will not disconnect the IP topology. This problem has been proven NP-hard in [1]. And an integer linear programming (ILP) formulation that solves this problem is provided in [2]. We p...
متن کاملDesign of survivable IP-over-optical networks
In the past years, telecommunications networks have seen an important evolution with the advances in optical technologies and the explosive growth of the Internet. Several optical systems allow a very large transport capacity, and data tra c has dramatically increased. Telecommunications networks are now moving towards a model of high-speed routers interconnected by intelligent optical core net...
متن کامل